A Database of Groups of Prime-power Order
نویسندگان
چکیده
The design, implementation and performance of TwoGroups, a deductive database for the 58,761 groups of order 2n, (n # 8), is described. The system is implemented in NU-Prolog, a Prolog system with built-in functions for creating and using deductive databases. TwoGroups has a set-theoretic query language, which provides users with a familiar notation to access the data. The paper describes the data and its representation, the set-theoretic query language, its translator and optimiser, and the experiments on the performance of the database.
منابع مشابه
Finite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملCharacterization of $mathrm{PSL}(5,q)$ by its Order and One Conjugacy Class Size
Let $p=(q^4+q^3+q^2+q+1)/(5,q-1)$ be a prime number, where $q$ is a prime power. In this paper, we will show $Gcong mathrm{PSL}(5,q)$ if and only if $|G|=|mathrm{PSL}(5,q)|$, and $G$ has a conjugacy class size $frac{| mathrm{PSL}(5,q)|}{p}$. Further, the validity of a conjecture of J. G. Thompson is generalized to the groups under consideration by a new way.
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کاملOn some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
متن کاملNormal edge-transitive Cayley graphs on the non-abelian groups of order $4p^2$, where $p$ is a prime number
In this paper, we determine all of connected normal edge-transitive Cayley graphs on non-abelian groups with order $4p^2$, where $p$ is a prime number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 24 شماره
صفحات -
تاریخ انتشار 1994